Statistical Concurrent Non-malleable Zero Knowledge
نویسندگان
چکیده
The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985 is fundamental in Cryptography. Motivated by conceptual and practical reasons, this notion has been explored under stronger definitions. We will consider the following two main strengthened notions. Statistical Zero Knowledge: here the zero-knowledge property will last forever, even in case in future the adversary will have unlimited
منابع مشابه
The Non-interactive Equivocable Non-malleable Commitment and its Applications
Under the assumption of the existence of one-way functions, we prove that it is possible to construct the non-interactive equivocable non-malleable commitment scheme. Especially importantly, we succeed in implementing concurrent zero-knowledge using our commitment scheme, analysising properties of this concurrent zero-knowledge proof system, comparing it with the existed concurrent zero-knowled...
متن کامل4-Round Concurrent Non-Malleable Commitments
The round complexity of non-malleable commitments and non-malleable zero knowledge arguments has been an open question for long time. Very recent results of Pass [TCC 2013] and of Goyal et al. [FOCS 2014, STOC 2016], gave almost definitive answers. In this work we show how to construct round-efficient non-malleable protocols via compilers. Starting from protocols enjoying limited non-malleabili...
متن کاملEfficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
Ever since the invention of Zero-Knowledge by Goldwasser, Micali, and Rackoff [1], Zero-Knowledge has become a central building block in cryptography with numerous applications, ranging from electronic cash to digital signatures. The properties of Zero-Knowledge range from the most simple (and not particularly useful in practice) requirements, such as honest-verifier zero-knowledge to the most ...
متن کاملConstant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
One of the central questions in Cryptography is the design of round-efficient protocols that are secure under concurrent man-in-the-middle attacks. In this paper we present the first constant-round concurrent non-malleable zero-knowledge argument system for NP in the Bare Public-Key model [Canetti et al. STOC 2000], resolving one of the major open problems in this area. To achieve our result, w...
متن کاملStatistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that are secure even against adversaries that interact with multiple provers and verifiers simultaneously. Recently, the first statistical CNMZK argument forNP was constructed under the DDH assumption (Orlandi el al., TCC’14). In this paper, we construct a statistical CNMZK argument forNP assuming only the ex...
متن کامل